Pattern matching as cut elimination
نویسندگان
چکیده
منابع مشابه
Pattern Matching as Cut Elimination
We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the Curry-Howard Isomorphism, in the sense that types, both for patterns and terms, correspond to propositions, terms corresp...
متن کاملNormalization as a Consequence of Cut Elimination
Pairs of systems, which consist of a system of sequents and a natural deduction system for some part of intuitionistic logic, are considered. For each of these pairs of systems the property that the normalization theorem is a consequence of the cut-elimination theorem is presented.
متن کاملClassical Proofs as Programs, Cut Elimination as Computation
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as presented in Danos et al.(1994), is isomorphic to call-by-name (CBN) and call-by-value (CBV) reduction system respectively. Our method is simple. We assign typed -terms on intuitionistic decoration of LKT/LKQ so as to simulate the cut-elimination procedure by -contraction | i.e. we simulate cutelim...
متن کاملProof Fragments, Cut-Elimination and Cut-Introduction
Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...
متن کاملCut-elimination and Redundancy-elimination by Resolution
Cut-elimination is one of the most important techniques in proof theory. Roughly speaking, eliminating cuts from a proof generates a new proof without lemmas, which essentially consists of the syntactic material of the proven theorem. Traditionally cutelimination served the purpose to show consistency of calculi and thus played a central role in metamathematics. In this traditional context the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.032